Bounds on the minimum distance of the duals of BCH codes
نویسندگان
چکیده
We consider primitive cyclic codes of length p − 1 over Fp. The codes of interest here are duals of BCH codes. For these codes, a lower bound on their minimum distance can be found via the adaptation of the Weil bound to cyclic codes (see [10]). However, this bound is of no significance for roughly half of these codes. We shall fill this gap by giving, in the first part of the paper, a lower bound for an infinite class of duals of BCH codes. Since this family is a filtration of the duals of BCH codes, the bound obtained for it induces a bound for all duals. In the second part we present a lower bound obtained by implementing an algorithmic method due to Massey and Schaub (the rankbounding algorithm). The numerical results are surprisingly higher than all previously known bounds.
منابع مشابه
On the Distance Distribution of Duals of BCH Codes
We derive upper bounds on the components of the distance distribution of duals of BCH codes.
متن کاملOn the duals of binary BCH codes
We give bounds for the minimal distance of duals of binary BCH codes in a range where the Carlitz-Uchiyama bound is trivial. This is done by estimating the number of points on certain curves over finite fields.
متن کاملA lower bound on the distance of cyclic codes
We present an algorithm to obtain a lower bound on the distance of cyclic codes, improving Schaub algorithm. In particular, we can provide new better bounds for the duals of binary primitive narrowsense BCH codes of length 255.
متن کاملOn the Dimension, Minimum Distance, and Duals of Primitive BCH Codes
We determine the dimension and in some cases the minimum distance of primitive, narrow sense BCH codes of length n with small designed distance. We show that such a code contains its Euclidean dual code and, when the size of the field is a perfect square, also its Hermitian dual code. We establish two series of quantum error-correcting codes.
متن کاملOn the existence and construction of good codes with low peak-to-average power ratios
The rst lower bound on the peak-to-average power ratio (PAPR) of a constant energy code of a given length n, minimum Euclidean distance and rate is established. Conversely, using a non-constructive Varshamov-Gilbert style argument yields a lower bound on the achievable rate of a code of a given length, minimum Euclidean distance and maximum PAPR. The derivation of these bounds relies on a geome...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 42 شماره
صفحات -
تاریخ انتشار 1996